Model-checking Timed Temporal Logics

Model-checking Timed Temporal Logics

In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.

Model-Checking for Extended Timed Temporal Logics

We introduce the real-time temporal logic BTATL p which is obtained by extending CTL with both past operators and timed automata constraints. Considering together past operators and automata constraints allows expressing timing requirements in a simple and natural way. Model-checking for full BTATL p is undecidable. Fortunately, there exist signiicant (both linear-time and branching-time) fragm...

Timed Temporal Logics

Since the early 1990’s, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on...

Model-checking temporal logics on pushdown systems

Model Checking with Multi-Valued Temporal Logics

Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dynamic properties of systems where complete, agreed upon models of the system are not available. This paper presents a symbolic model checker for multi-valued temporal logics. The model checker works for any multivalued ...